| 翻訳と辞書 |
| Holevo's theorem ： ウィキペディア英語版 |
Holevo's theorem
Holevo's theorem is an important limitative theorem in quantum computing, an interdisciplinary field of physics and computer science. It is sometimes called Holevo's bound, since it establishes an upper bound to the amount of information which can be known about a quantum state (accessible information). It was published by Alexander Holevo in 1973.
==Accessible Information==
As for several concepts in quantum information theory, accessible information is best understood in terms of a 2-party communication. So we introduce two parties, Alice and Bob. Alice has a ''classical'' random variable ''X'', which can take the values with corresponding probabilities . Alice then prepares a quantum state, represented by the density matrix ''ρX'' chosen from a set , and gives this state to Bob. Bob's goal is to find the value of ''X'', and in order to do that, he performs a measurement on the state ''ρ''''X'', obtaining a classical outcome, which we denote with ''Y''. In this context, the amount of accessible information, that is, the amount of information that Bob can get about the variable ''X'', is the maximum value of the mutual information ''I''(''X'' : ''Y'') between the random variables ''X'' and ''Y'' over all the possible measurements that Bob can do.
There is currently no known formula to compute the accessible information. There are however several upper bounds, the best-known of which is the Holevo bound, which is specified in the following theorem.〔
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Holevo's theorem」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|